Entangled Parametric Hierarchies: Problems for an Overspecified Universal Grammar

نویسندگان

  • Cedric Boeckx
  • Evelina Leivada
چکیده

This study addresses the feasibility of the classical notion of parameter in linguistic theory from the perspective of parametric hierarchies. A novel program-based analysis is implemented in order to show certain empirical problems related to these hierarchies. The program was developed on the basis of an enriched data base spanning 23 contemporary and 5 ancient languages. The empirical issues uncovered cast doubt on classical parametric models of language acquisition as well as on the conceptualization of an overspecified Universal Grammar that has parameters among its primitives. Pinpointing these issues leads to the proposal that (i) the (bio)logical problem of language acquisition does not amount to a process of triggering innately pre-wired values of parameters and (ii) it paves the way for viewing language, epigenetic ('parametric') variation as an externalization-related epiphenomenon, whose learning component may be more important than what sometimes is assumed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supporting designers' hierarchies through parametric shape recognition

The need to implement shape grammars efficiently, rather than hardcode them, in a way that supports creativity through shape emergence is an ongoing research challenge. This paper introduces a shape grammar interpreter that supports parametric subshape recognition, and thereby shape emergence. The approach divides shapes into hierarchies of subshapes based on specified geometric relationships w...

متن کامل

Universal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?

  Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...

متن کامل

Instance compression of parametric problems and related hierarchies

We define instance compressibility ([13, 17]) for parametric problems in the classes PH and PSPACE. We observe that the problem ΣiCIRCUITSAT of deciding satisfiability of a quantified Boolean circuit with i−1 alternations of quantifiers starting with an existential quantifier is complete for parametric problems in the class Σ i with respect to w-reductions, and that analogously the problem QBCS...

متن کامل

Realization of a Classically Distinguishable Multi-photon Quantum Superposition

We report the successful generation of an entangled multiparticle quantum superposition of pure photon states. They result from a multiple universal cloning of a single photon qubit by a high gain, quantum-injected parametric amplifier. The information preserving property of the process suggests for these states the name of ”multi-particle qubits”. They are ideal objects for investigating the e...

متن کامل

An annotation scheme for Persian based on Autonomous Phrases Theory and Universal Dependencies

A treebank is a corpus with linguistic annotations above the level of the parts of speech. During the first half of the present decade, three treebanks have been developed for Persian either originally or subsequently based on dependency grammar: Persian Treebank (PerTreeBank), Persian Syntactic Dependency Treebank, and Uppsala Persian Dependency Treebank (UPDT). The syntactic analysis of a sen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2013